import java.util.Scanner;

public class MidFind {
    /*
      二分查找
     */
    public static void main(String[] arg0s) {
        Scanner scanner = new Scanner(System.in);
        int k = scanner.nextInt();
        int[] a = {1,3,4,5,6,8,10,11,13,25};
        int low = 0;
        int high = a.length-1;
        int mid = (high + low)/2;
        while (true){
            if (k==a[mid]){
                System.out.println("find");
                break;
            }
            if(k<a[mid]){
                high = mid-1;
                mid = (high + low)/2;
            }
            else {
                low = mid+1;
                mid = (high+low)/2;
            }


        }





        }


}
